n = int(input())
k1 = list(map(int, input()))
k2 = list(map(int, input()))
print(sum(min(10 - abs(k1[i] - k2[i]),
abs(k1[i] - k2[i])) for i in range(n)))
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int n;
string s1, s2;
cin>>n>>s1>>s2;
int answer = 0;
for(int i=0; i<n; i++){
int i1 = (int)s1[i] - 48, i2 = (int)s2[i] - 48;
answer += min(abs(i1 - i2), abs(max(i1, i2) - 10) + min(i1, i2));
}
cout<<answer<<endl;
}2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |